UPPER BOUND THEOREM FOR ODD‐DIMENSIONAL FLAG TRIANGULATIONS OF MANIFOLDS
نویسندگان
چکیده
منابع مشابه
An upper bound for the number of planar lattice triangulations
We prove an exponential upper bound for the number f(m,n) of all maximal triangulations of the m × n grid: f(m,n) < 2. In particular, this improves a result of S. Yu. Orevkov [1]. We consider lattice polygons P (with vertices in Z), for example the convex hull of the grid Pm,n := {0, 1, . . . , m} × {0, 1, . . . , n}. We want to estimate the number of maximal lattice triangulations of P , i.e.,...
متن کاملINVARIANTS FROM TRIANGULATIONS OF HYPERBOLIC 3 - MANIFOLDS 3 Theorem
For any nite volume hyperbolic 3-manifold M we use ideal tri-angulation to deene an invariant (M) in the Bloch group B(C). It actually lies in the subgroup of B(C) determined by the invariant trace eld of M. The Chern-Simons invariant of M is determined modulo rationals by (M). This implies rationality and | assuming the Ramakrishnan conjecture | ir-rationality results for Chern Simons invarian...
متن کاملCourcelle's theorem for triangulations
In graph theory, Courcelle’s theorem essentially states that, if an algorithmic problem can be formulated in monadic second-order logic, then it can be solved in linear time for graphs of bounded treewidth. We prove such a metatheorem for a general class of triangulations of arbitrary fixed dimension d, including all triangulated d-manifolds: if an algorithmic problem can be expressed in monadi...
متن کاملAn Upper Bound Theorem concerning lattice polytopes
R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of integrally closed lattice polytopes. Finally we apply our results for reflexive integrally closed and order polytopes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematika
سال: 2016
ISSN: 0025-5793,2041-7942
DOI: 10.1112/s0025579316000115